33 research outputs found
Toward a Robust Sparse Data Representation for Wireless Sensor Networks
Compressive sensing has been successfully used for optimized operations in
wireless sensor networks. However, raw data collected by sensors may be neither
originally sparse nor easily transformed into a sparse data representation.
This paper addresses the problem of transforming source data collected by
sensor nodes into a sparse representation with a few nonzero elements. Our
contributions that address three major issues include: 1) an effective method
that extracts population sparsity of the data, 2) a sparsity ratio guarantee
scheme, and 3) a customized learning algorithm of the sparsifying dictionary.
We introduce an unsupervised neural network to extract an intrinsic sparse
coding of the data. The sparse codes are generated at the activation of the
hidden layer using a sparsity nomination constraint and a shrinking mechanism.
Our analysis using real data samples shows that the proposed method outperforms
conventional sparsity-inducing methods.Comment: 8 page
Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications
Wireless sensor networks monitor dynamic environments that change rapidly
over time. This dynamic behavior is either caused by external factors or
initiated by the system designers themselves. To adapt to such conditions,
sensor networks often adopt machine learning techniques to eliminate the need
for unnecessary redesign. Machine learning also inspires many practical
solutions that maximize resource utilization and prolong the lifespan of the
network. In this paper, we present an extensive literature review over the
period 2002-2013 of machine learning methods that were used to address common
issues in wireless sensor networks (WSNs). The advantages and disadvantages of
each proposed algorithm are evaluated against the corresponding problem. We
also provide a comparative guide to aid WSN designers in developing suitable
machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial
Rate-distortion Balanced Data Compression for Wireless Sensor Networks
This paper presents a data compression algorithm with error bound guarantee
for wireless sensor networks (WSNs) using compressing neural networks. The
proposed algorithm minimizes data congestion and reduces energy consumption by
exploring spatio-temporal correlations among data samples. The adaptive
rate-distortion feature balances the compressed data size (data rate) with the
required error bound guarantee (distortion level). This compression relieves
the strain on energy and bandwidth resources while collecting WSN data within
tolerable error margins, thereby increasing the scale of WSNs. The algorithm is
evaluated using real-world datasets and compared with conventional methods for
temporal and spatial data compression. The experimental validation reveals that
the proposed algorithm outperforms several existing WSN data compression
methods in terms of compression efficiency and signal reconstruction. Moreover,
an energy analysis shows that compressing the data can reduce the energy
expenditure, and hence expand the service lifespan by several folds.Comment: arXiv admin note: text overlap with arXiv:1408.294
Profit Maximization Auction and Data Management in Big Data Markets
A big data service is any data-originated resource that is offered over the
Internet. The performance of a big data service depends on the data bought from
the data collectors. However, the problem of optimal pricing and data
allocation in big data services is not well-studied. In this paper, we propose
an auction-based big data market model. We first define the data cost and
utility based on the impact of data size on the performance of big data
analytics, e.g., machine learning algorithms. The big data services are
considered as digital goods and uniquely characterized with "unlimited supply"
compared to conventional goods which are limited. We therefore propose a
Bayesian profit maximization auction which is truthful, rational, and
computationally efficient. The optimal service price and data size are obtained
by solving the profit maximization auction. Finally, experimental results on a
real-world taxi trip dataset show that our big data market model and auction
mechanism effectively solve the profit maximization problem of the service
provider.Comment: 6 pages, 9 figures. This paper was accepted by IEEE WCNC conference
in Dec. 201
Privacy Management and Optimal Pricing in People-Centric Sensing
With the emerging sensing technologies such as mobile crowdsensing and
Internet of Things (IoT), people-centric data can be efficiently collected and
used for analytics and optimization purposes. This data is typically required
to develop and render people-centric services. In this paper, we address the
privacy implication, optimal pricing, and bundling of people-centric services.
We first define the inverse correlation between the service quality and privacy
level from data analytics perspectives. We then present the profit maximization
models of selling standalone, complementary, and substitute services.
Specifically, the closed-form solutions of the optimal privacy level and
subscription fee are derived to maximize the gross profit of service providers.
For interrelated people-centric services, we show that cooperation by service
bundling of complementary services is profitable compared to the separate sales
but detrimental for substitutes. We also show that the market value of a
service bundle is correlated with the degree of contingency between the
interrelated services. Finally, we incorporate the profit sharing models from
game theory for dividing the bundling profit among the cooperative service
providers.Comment: 16 page
Market Model and Optimal Pricing Scheme of Big Data and Internet of Things (IoT)
Big data has been emerging as a new approach in utilizing large datasets to
optimize complex system operations. Big data is fueled with Internet-of-Things
(IoT) services that generate immense sensory data from numerous sensors and
devices. While most current research focus of big data is on machine learning
and resource management design, the economic modeling and analysis have been
largely overlooked. This paper thus investigates the big data market model and
optimal pricing scheme. We first study the utility of data from the data
science perspective, i.e., using the machine learning methods. We then
introduce the market model and develop an optimal pricing scheme afterward. The
case study shows clearly the suitability of the proposed data utility
functions. The numerical examples demonstrate that big data and IoT service
provider can achieve the maximum profit through the proposed market model
Efficient Data Compression with Error Bound Guarantee in Wireless Sensor Networks
We present a data compression and dimensionality reduction scheme for data
fusion and aggregation applications to prevent data congestion and reduce
energy consumption at network connecting points such as cluster heads and
gateways. Our in-network approach can be easily tuned to analyze the data
temporal or spatial correlation using an unsupervised neural network scheme,
namely the autoencoders. In particular, our algorithm extracts intrinsic data
features from previously collected historical samples to transform the raw data
into a low dimensional representation. Moreover, the proposed framework
provides an error bound guarantee mechanism. We evaluate the proposed solution
using real-world data sets and compare it with traditional methods for temporal
and spatial data compression. The experimental validation reveals that our
approach outperforms several existing wireless sensor network's data
compression methods in terms of compression efficiency and signal
reconstruction.Comment: ACM MSWiM 201
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
Reconstructing Human Pose from Inertial Measurements: A Generative Model-based Compressive Sensing Approach
The ability to sense, localize, and estimate the 3D position and orientation
of the human body is critical in virtual reality (VR) and extended reality (XR)
applications. This becomes more important and challenging with the deployment
of VR/XR applications over the next generation of wireless systems such as 5G
and beyond. In this paper, we propose a novel framework that can reconstruct
the 3D human body pose of the user given sparse measurements from Inertial
Measurement Unit (IMU) sensors over a noisy wireless environment. Specifically,
our framework enables reliable transmission of compressed IMU signals through
noisy wireless channels and effective recovery of such signals at the receiver,
e.g., an edge server. This task is very challenging due to the constraints of
transmit power, recovery accuracy, and recovery latency. To address these
challenges, we first develop a deep generative model at the receiver to recover
the data from linear measurements of IMU signals. The linear measurements of
the IMU signals are obtained by a linear projection with a measurement matrix
based on the compressive sensing theory. The key to the success of our
framework lies in the novel design of the measurement matrix at the
transmitter, which can not only satisfy power constraints for the IMU devices
but also obtain a highly accurate recovery for the IMU signals at the receiver.
This can be achieved by extending the set-restricted eigenvalue condition of
the measurement matrix and combining it with an upper bound for the power
transmission constraint. Our framework can achieve robust performance for
recovering 3D human poses from noisy compressed IMU signals. Additionally, our
pre-trained deep generative model achieves signal reconstruction accuracy
comparable to an optimization-based approach, i.e., Lasso, but is an order of
magnitude faster